Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems
نویسندگان
چکیده
منابع مشابه
Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملMathematical programming with multiple sets split monotone variational inclusion constraints
In this paper, we first study a hierarchical problem of Baillon’s type, and we study a strong convergence theorem of this problem. For the special case of this convergence theorem, we obtain a strong convergence theorem for the ergodic theorem of Baillon’s type. Our result of the ergodic theorem of Baillon’s type improves and generalizes many existence theorems of this type of problem. Two nume...
متن کاملAn algorithm for the split-feasibility problems with application to the split-equality problem
In this paper, we study the split-feasibility problem in Hilbert spaces by using the projected reflected gradient algorithm. As applications, we study the convex linear inverse problem and the split-equality problem in Hilbert spaces, and we give new algorithms for these problems. Finally, numerical results are given for our main results.
متن کاملAlternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
In this paper, we present an extended alternating proximal penalization algorithm for the modified multiple-sets feasibility problem. For this method, we first show that the sequences generated by the algorithm are summable, which guarantees that the distance between two adjacent iterates converges to zero, and then we establish the global convergence of the algorithm provided that the penalty ...
متن کاملModified Alternating Direction Methods for the Modified Multiple-Sets Split Feasibility Problems
In this paper, we propose two new multiple-sets split feasibility problem (MSFP) models, where the MSFP requires to find a point closest to the intersection of a family of closed convex sets in one space, such that its image under a linear transformation will be closest to the intersection of another family of closed convex sets in the image space. This problem arises in image restoration, sign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2013
ISSN: 1687-1812
DOI: 10.1186/1687-1812-2013-333